Packing Hamilton Cycles Online
نویسندگان
چکیده
It is known that w.h.p. the hitting time τ2σ for the random graph process to have minimum degree 2σ coincides with the hitting time for σ edge disjoint Hamilton cycles, [4], [13], [9]. In this paper we prove an online version of this property. We show that, for a fixed integer σ ≥ 2, if random edges of Kn are presented one by one then w.h.p. it is possible to color the edges online with σ colors so that at time τ2σ, each color class is Hamiltonian.
منابع مشابه
Optimal covers with Hamilton cycles in random graphs
A packing of a graph G with Hamilton cycles is a set of edgedisjoint Hamilton cycles in G. Such packings have been studied intensively and recent results imply that a largest packing of Hamilton cycles in Gn,p a.a.s. has size bδ(Gn,p)/2c. Glebov, Krivelevich and Szabó recently initiated research on the ‘dual’ problem, where one asks for a set of Hamilton cycles covering all edges of G. Our main...
متن کاملHamilton decompositions of regular expanders: Applications
In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this theorem is that every regular tournament on n vertices can be decomposed into (n − 1)/2 edge-disjoint Hamilton cycles, whenever n is sufficiently large. This v...
متن کاملPacking and counting arbitrary Hamilton cycles in random digraphs
We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in D(n, p) for nearly optimal p (up to a logc n factor). In particular, we show that given t = (1 − o(1))np Hamilton cycles C1, . . . , Ct, each of which is oriented arbitrarily, a digraph D ∼ D(n, p) w.h.p. contains edge disjoint copies of C1, . . . , Ct, provided p = ω(log 3 n/n). We also show that given an arbitr...
متن کاملCounting and packing Hamilton cycles in dense graphs and oriented graphs
We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several extremal results. In particular, we show that every nearly cn-regular oriented graph on n vertices with c > 3/8 contains (cn/e)(1 + o(1)) directed Hamilton cycles. This is an extension of a result of Cuckler, who settle...
متن کاملHamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments
A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n− 1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n. In fact, we prove a far more general result, based on our recent concept of robust expansion and a new method for decomposing graphs. We show that every sufficiently large regular digraph G on n vertices whose...
متن کامل